Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
cons(x,cons(y,z)) |
→ big |
| 2: |
|
inf(x) |
→ cons(x,inf(s(x))) |
|
There are 2 dependency pairs:
|
| 3: |
|
INF(x) |
→ CONS(x,inf(s(x))) |
| 4: |
|
INF(x) |
→ INF(s(x)) |
|
The approximated dependency graph contains one SCC:
{4}.
-
Consider the SCC {4}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006